An Improved Cuckoo Search Algorithm With Stud Crossover for Chinese TSP Problem

The travelling salesman problem (TSP) is an NP-hard in combinatorial optimization. It has assumed significance operations research and theoretical computer science. was first formulated 1930 since then, been one of the most extensively studied problems In fact, it used as a benchmark for many optimization methods. This paper represents new method to addressing TSP using improved version cuckoo search (CS) with Stud (SCS) crossover operator. SCS method, similar genetic operators various metaheuristic algorithms, operator that originated from classical algorithm, introduced into CS aim improving its effectiveness reliability while dealing TSP. Various test functions had this approach, subsequently find shortest path Chinese (CTSP). Experimental results presented clearly demonstrates viable attractive addition portfolio swarm intelligence techniques.